Global minimum search via annealing: Nanoscale gold clusters

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Search for global minimum geometries for medium sized germanium clusters: Ge12-Ge20.

We have performed an unbiased search for the global minimum geometries of small-to-medium sized germanium clusters Gen(12< or =n< or =18) as well as a biased search (using seeding method) for Gen(17< or =n< or =20). We employed the basin-hopping algorithm coupled with the plane-wave pseudopotential density functional calculations. For each size, we started the unbiased search with using several...

متن کامل

Search for global-minimum geometries of medium-sized germanium clusters. II. Motif-based low-lying clusters Ge21-Ge29.

We performed a constrained search for the geometries of low-lying neutral germanium clusters Ge(N) in the size range of 21 < or = N < or = 29. The basin-hopping global optimization method is employed for the search. The potential-energy surface is computed based on the plane-wave pseudopotential density functional theory. A new series of low-lying clusters is found on the basis of several gener...

متن کامل

NTP Research Concept: Nanoscale Gold

program prior to designing and conducting toxicology studies. The purpose of the research concept document is to outline the general elements of a research program that would address the specific public health concerns that prompted the nomination of the substance or issue for study. It may also encompass substance-specific studies that address larger public health issues or topics in toxicolog...

متن کامل

Nanoscale Atomic Clusters, Complexity of

200. von Hippel AR (1956) Molecular engineering. Science 123(3191):315–317 201. von Neumann J (1956) Probabilistic Logics and the Synthesis of Reliable Organisms from Unreliable Components. In: Automata Studies. Princeton University Press, Princeton, pp 43–98 202. Waingold E, Taylor M, SrikrishnaD, Sarkar V, Lee W, Lee V, Kim J, Frank M, Finch P, Barua R, Babb J, Amarasinghe S, Agarwal A (1997)...

متن کامل

Improved Cuckoo Search Algorithm for Global Optimization

The cuckoo search algorithm is a recently developedmeta-heuristic optimization algorithm, which is suitable forsolving optimization problems. To enhance the accuracy andconvergence rate of this algorithm, an improved cuckoo searchalgorithm is proposed in this paper. Normally, the parametersof the cuckoo search are kept constant. This may lead todecreasing the efficiency of the algorithm. To cop...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Chemical Physics Letters

سال: 2015

ISSN: 0009-2614

DOI: 10.1016/j.cplett.2015.01.026